On the Histogram as a Density Estimator: L 2 Theory
نویسنده
چکیده
Let f be a probability density on an interval I, finite or infinite: I includes its finite endpoints, if any; and f vanishes outside of I. Let X1, . . . ,X k be independent random variables, with common density f The empirical histogram for the X's is often used to estimate f To define this object, choose a reference point xosI and a cell width h. Let Nj be the number of X's falling in the j th class interval:
منابع مشابه
A Berry-Esseen Type Bound for a Smoothed Version of Grenander Estimator
In various statistical model, such as density estimation and estimation of regression curves or hazard rates, monotonicity constraints can arise naturally. A frequently encountered problem in nonparametric statistics is to estimate a monotone density function f on a compact interval. A known estimator for density function of f under the restriction that f is decreasing, is Grenander estimator, ...
متن کاملEstimation of mutual information by the fuzzy histogram
Abstract Mutual Information (MI) is an important dependency measure between random variables, due to its tight connection with information theory. It has numerous applications, both in theory and practice. However, when employed in practice, it is often necessary to estimate the MI from available data. There are several methods to approximate the MI, but arguably one of the simplest and most wi...
متن کاملHistogram density estimators based upon a fuzzy partition
This paper presents a density estimator based upon a histogram computed on a fuzzy partition. We prove the consistency of this estimator in the Mean Squared Error (MSE). We give the optimal bin width of the estimator which minimizes the Asymptotic Integrated Mean Squared Error (AIMSE). c © 2008 Elsevier B.V. All rights reserved.
متن کاملAsymptotic Behaviors of Nearest Neighbor Kernel Density Estimator in Left-truncated Data
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
متن کاملObject Shape Representation by Kernel Density Feature Points Estimator
This paper introduces an object shape representation using Kernel Density Feature Points Estimator (KDFPE). In this method we obtain the density of feature points within defined rings around the centroid of the image. The Kernel Density Feature Points Estimator is then applied to the vector of the image. KDFPE is invariant to translation, scale and rotation. This method of image representation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004